Modelling Attacker's Knowledge for Cascade Cryptographic Protocols

نویسنده

  • Nazim Benassa
چکیده

We address the proof-based development of cryptographic protocols satisfying security properties. Communication channels are supposed to be unsafe. Analysing cryptographic protocols requires precise modelling of the attacker’s knowledge. In this paper we use the event B modelling language to model the knowledge of the attacker for a class of cryptographic protocols called cascade protocols. The attacker’s behaviour conforms to the Dolev-Yao model. In the Dolev-Yao model, the attacker has full control of the communication channel, and the cryptographic primitives are supposed to be perfect. key-words: cryptography, model for attacker, formal methods

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Formal representation and reasoning approaches in modelling cryptographic protocols

We survey at a very high level some examples of existing work involving the formal verification of the properties of cryptographic protocols. For the purposes of this survey, formal verification includes the use of logics, proof systems, and inductive reasoning. The goal of this survey is twofold. First, it reviews a few existing attempts found in the literature to model cryptographic protocols...

متن کامل

Specification of Agent Explicit Knowledge in Cryptographic Protocols

Cryptographic protocols are widely used in various applications to provide secure communications. They are usually represented as communicating agents that send and receive messages. These agents use their knowledge to exchange information and communicate with other agents involved in the protocol. An agent knowledge can be partitioned into explicit knowledge and procedural knowledge. The expli...

متن کامل

Formalization in PVS of Balancing Properties Necessary for the Security of the Dolev-Yao Cascade Protocol Model

Nowadays, formalizing computationally the security of cryptographic protocols is a highly sophisticated task of great relevance. In this work, we present an algebraic approach for modeling the twoparty cascade protocol of Dolev-Yao in the specification language of the Prototype Verification System PVS. Although cascade protocols could be argued to be a very limited model, it should be stressed ...

متن کامل

Verification of Security Protocols Using A Formal Approach

Security protocols are expected to build secure communications over vulnerable networks. However, security protocols may contain potential flaws. Therefore, they need formal verifications. In this thesis, we investigate Paulson’s inductive approach and apply this formal approach to a classical cryptographic protocol which has not been previously verified in this way. We also investigate the mod...

متن کامل

EquivalEncEs and calculi for formal vErification of cryptographic protocols

Security protocols are essential to the proper functioning of any distributed system running over an insecure network but often have flaws that can be exploited even without breaking the cryptography. Formal cryptography, the assumption that the cryptographic primitives are flawless, facilitates the construction of formal models and verification tools. Such models are often based on process cal...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008